Nonnegative matrix factorization with local similarity learning
نویسندگان
چکیده
Existing nonnegative matrix factorization methods usually focus on learning global structure of the data to construct basis and coefficient matrices, which ignores local that commonly exists among data. To overcome this drawback, in paper, we propose a new type method, learns similarity clustering mutually enhanced way. The learned representation is more representative it better reveals inherent geometric property Moreover, performed kernel space, enhances capability proposed model discovering nonlinear structures Multiplicative updating rules are developed with theoretical convergence guarantees. Extensive experimental results have confirmed effectiveness model.
منابع مشابه
Local Learning Regularized Nonnegative Matrix Factorization
Nonnegative Matrix Factorization (NMF) has been widely used in machine learning and data mining. It aims to find two nonnegative matrices whose product can well approximate the nonnegative data matrix, which naturally lead to parts-based representation. In this paper, we present a local learning regularized nonnegative matrix factorization (LLNMF) for clustering. It imposes an additional constr...
متن کاملNonnegative Matrix Factorization with Transform Learning
Traditional NMF-based signal decomposition relies on the factorization of spectral data which is typically computed by means of the short-time Fourier transform. In this paper we propose to relax the choice of a pre-fixed transform and learn a short-time unitary transform together with the factorization, using a novel block-descent algorithm. This improves the fit between the processed data and...
متن کاملLearning manifold to regularize nonnegative matrix factorization
In this chapter we discuss how to learn an optimal manifold presentation to regularize nonegative matrix factorization (NMF) for data representation problems. NMF, which tries to represent a nonnegative data matrix as a product of two low rank nonnegative matrices, has been a popular method for data representation due to its ability to explore the latent part-based structure of data. Recent stu...
متن کاملQuantized nonnegative matrix factorization
Even though Nonnegative Matrix Factorization (NMF) in its original form performs rank reduction and signal compaction implicitly, it does not explicitly consider storage or transmission constraints. We propose a Frobenius-norm Quantized Nonnegative Matrix Factorization algorithm that is 1) almost as precise as traditional NMF for decomposition ranks of interest (with in 1-4dB), 2) admits to pra...
متن کاملQuadratic nonnegative matrix factorization
In Nonnegative Matrix Factorization (NMF), a nonnegative matrix is approximated by a product of lower-rank factorizing matrices. Most NMF methods assume that each factorizing matrix appears only once in the approximation, thus the approximation is linear in the factorizing matrices. We present a new class of approximative NMF methods, called Quadratic Nonnegative Matrix Factorization (QNMF), wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2021
ISSN: ['0020-0255', '1872-6291']
DOI: https://doi.org/10.1016/j.ins.2021.01.087